Closest Pair and the Post Office Problem for Stochastic Points
نویسندگان
چکیده
Given a (master) set M of n points in d-dimensional Euclidean space, consider drawing a random subset that includes each point mi ∈ M with an independent probability pi. How difficult is it to compute elementary statistics about the closest pair of points in such a subset? For instance, what is the probability that the distance between the closest pair of points in the random subset is no more than `, for a given value `? Or, can we preprocess the master set M such that given a query point q, we can efficiently estimate the expected distance from q to its nearest neighbor in the random subset? We obtain hardness results and approximation algorithms for stochastic problems of this kind.
منابع مشابه
Stochastic Closest-Pair Problem and Most-Likely Nearest-Neighbor Search in Tree Spaces
Let T be a tree space (or tree network) represented by a weighted tree with t vertices, and S be a set of n stochastic points in T , each of which has a fixed location with an independent existence probability. We investigate two fundamental problems under such a stochastic setting, the closest-pair problem and the nearest-neighbor search. For the former, we study the computation of the `-thres...
متن کاملAlgorithms for Polytope Covering and Approximation, and for Approximate Closest-point Queries
This paper gives an algorithm for polytope covering : let L and U be sets of points in R, comprising n points altogether. A cover for L from U is a set C ⊂ U with L a subset of the convex hull of C. Suppose c is the size of a smallest such cover, if it exists. The randomized algorithm given here finds a cover of size no more than c(5d ln c), for c large enough. The algorithm requires O(cn) expe...
متن کاملClosest-Point Problems in Computational Geometry
Michiel Smid Fakult at f ur Informatik Otto-von-Guericke-Universitat Magdeburg Universitatsplatz 2 D-39106 Magdeburg, Germany E-mail: [email protected] September 1, 1997 Abstract This is the preliminary version of a chapter that will appear in the Handbook on Computational Geometry, edited by J.-R. Sack and J. Urrutia. A comprehensive overview is given of algorithms and data s...
متن کاملA Simple Yet Fast Algorithm for the Closest-Pair Problem Using Sorted Projections on Multi-Dimensions
We present a simple greedy algorithm, QuickCP, for finding the closestpair of points on a plane. It is based on the observation that if two points are close to each other, then it is very likely that their sorted projections to x-axis and/or to y-axis will reflect that closeness. Therefore we order our search starting from the pairs with closest x-projections (and closest y-projections) to find...
متن کاملLazy Algorithms for Dynamic Closest Pair with Arbitary Distance Measures
We propose novel lazy algorithms for the dynamic closest pair problem with arbitrary distance measures. In this problem we have to maintain the closest pair of points under insertion and deletion operations, where the distance between two points must be symmetric and take value in a totally ordered set. Many geometric special cases of this problem are well-studied, but only few algorithms are k...
متن کامل